A probabilistic analysis of the maximal covering location problem
نویسندگان
چکیده
منابع مشابه
General form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملHybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering locationallocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This pa...
متن کاملA hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem
This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents variables that can be partitioned into location and allocation decisions. This model is solved to optimality for small and medium-size instances. To tackle larger instances, a f...
متن کاملA Constructive Genetic Algorithm for the Maximal Covering Location Problem
The Constructive Genetic Algorithm (CGA) was proposed by Lorena and Furtado [6], as an alternative to the traditional GAs approach. Particularly the CGA directly evaluates schemata, works with a dynamic population size, performs mutation in complete structures, and uses heuristics in schemata and/or structure representation. The schemata are evaluated and can be added to the population if they ...
متن کاملA Decomposition Heuristic for the Maximal Covering Location Problem
This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90006-a